An Efficient and Robust Singular Value Method for Star Pattern Recognition and Attitude Determination
نویسندگان
چکیده
A new star pattern recognition method is developed using singular value decomposition of a measured unit column vector matrix in a measurement frame and the corresponding cataloged vector matrix in a reference frame. It is shown that singular values and right singular vectors are invariant with respect to coordinate transformation and robust under uncertainty. One advantage of singular value comparison is that a pairing process for individual measured and cataloged stars is not necessary, and the attitude estimation and pattern recognition process are not separated. An associated method for mission catalog design is introduced and simulation results are presented. Introduction Star cameras are among the most attractive attitude sensors because they provide three-axis attitude information with high accuracy. Star pattern recognition is an integrated part of star cameras. It is based on the invariant properties from coordinate transformation. For the past two decades, many of the invariant properties, such as angular separation, brightness of star, shape of triangles with vertices of star, and constellations, have been utilized for star identification. In practice, one of the challenges of using these star trackers arises when initializing sensors and/or recovering them from sudden failure is to efficiently solve the “lost-in-space” problem. Even though a-priori attitude estimation is not necessary for a star tracker, these initializing problems without a-priori attitude information tend to require intensive computer storage and 1 Principal Scientist, Structural Dynamics 2 Graduate Student, Department of Aerospace Engineering 3 Distinguish University Professor, Department of Aerospace Engineering
منابع مشابه
الگوریتمی جدید در تشخیص قالب و مرکزیابی دقیق ستارگان تصاویر آسمان شب
In this paper a novel night sky star pattern recognition and precise centroiding approaches are proposed. Precision and computation time of image processing algorithm paly a great role in spacecraft in which the night sky star images are utilized for attitude determination. Star pattern recognition and centroiding are the most important steps of image processing algorithm in such attitude deter...
متن کاملDisguised Face Recognition by Using Local Phase Quantization and Singular Value Decomposition
Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کاملStar Tracker Attitude Estimation for an Indoor Ground-Based Spacecraft Simulator
This paper presents a study of star tracker attitude estimation algorithms and implementation on an indoor ground-based Three Axis Spacecraft Simulator (TASS). Angle, Planar Triangle, and Spherical Triangle algorithms are studied for star pattern recognition. Least squares, QUEST and TRIAD algorithms are studied for attitude determination. A star field image is suspended above TASS. The indoor ...
متن کاملAn Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme
We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...
متن کامل